Local Ordinal Embedding
نویسندگان
چکیده
We study the problem of ordinal embedding: given a set of ordinal constraints of the form distance(i, j) < distance(k, l) for some quadruples (i, j, k, l) of indices, the goal is to construct a point configuration x̂1, ..., x̂n in R that preserves these constraints as well as possible. Our first contribution is to suggest a simple new algorithm for this problem, Soft Ordinal Embedding. The key feature of the algorithm is that it recovers not only the ordinal constraints, but even the density structure of the underlying data set. As our second contribution we prove that in the large sample limit it is enough to know “local ordinal information” in order to perfectly reconstruct a given point configuration. This leads to our Local Ordinal Embedding algorithm, which can also be used for graph drawing.
منابع مشابه
Biometrics Recognition based on Image Local Features Ordinal Encoding
In the present informational era, with the continue extension of embedded computing systems, the demand of faster and robust image descriptors is an important issue. However, image representation and recognition is an open problem. The aim of the paper is to embrace ordinal measurements for image analysis and to apply the concept for a real problem, such as biometric identification. Biometrics ...
متن کاملPoint Localization and Density Estimation from Ordinal Knn Graphs Using Synchronization
We consider the problem of embedding unweighted, directed k-nearest neighbor graphs in low-dimensional Euclidean space. The k-nearest neighbors of each vertex provide ordinal information on the distances between points, but not the distances themselves. Relying only on such ordinal information, along with the low-dimensionality, we recover the coordinates of the points up to arbitrary similarit...
متن کاملA hybrid approach of ordinal optimization and iterated local search for manufacturing cell formation
One of the fundamental problems in cellular manufacturing is grouping products with similar features into families and associated machines into cells. The objective is to maximize grouping efficacy, which indicates the within-cell machine utilization and the inter-cell movement. In this paper, a novel hybrid approach combining ordinal optimization (OO) and iterated local search (ILS) is present...
متن کاملOrdinal Embedding with a Latent Factor Model
Constructing low-dimensional embeddings based on ordinal measurements has been a subject of significant recent interest, motivated in part by machine learning applications using human input in a robust way. Recent work has focused on observations of comparisons on distances between objects. We consider a different model where the embedding is formed within a latent space of factors upon which a...
متن کاملUniqueness of Ordinal Embedding
Ordinal embedding refers to the following problem: all we know about an unknown set of points x1, . . . , xn ∈ R are ordinal constraints of the form ‖xi−xj‖ < ‖xk−xl‖; the task is to construct a realization y1, . . . , yn ∈ R that preserves these ordinal constraints. It has been conjectured since the 1960ies that upon knowledge of all ordinal constraints a large but finite set of points can be ...
متن کامل